On sparse perfect powers
نویسندگان
چکیده
This work is devoted to proving that, given an integer $x \ge 2$, there are infinitely many perfect powers, coprime with $x$, having exactly $k 3$ non-zero digits in their base $x$ representation, except for the case $x=2, k=4$, which a known finiteness result by Corvaja and Zannier holds.
منابع مشابه
Sparse Perfect Powers
We examine the problem of detecting when a given sparse polynomial f is equal to hr for some other polynomial h and integer r ≥ 2. In this case we say f is a perfect power, and h is its r th root. We give randomized algorithms to detect when f is a perfect power, by repeatedly evaluating the polynomial in specially-chosen finite fields and checking whether the evaluations are themselves perfect...
متن کاملPerfect Matchings and Perfect Powers
In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers (N. Elkies et al., J. Algebraic Combin. 1 (1992), 111– 132; B.-Y. Yang, Ph.D. thesis, Department of Mathematics, MIT, Cambridge, MA, 1991; J. Propp, New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999). In this pa...
متن کاملOn Perfect Powers in Lucas Sequences
Let (un)n≥0 be the binary recurrent sequence of integers given by u0 = 0, u1 = 1 and un+2 = 2(un+1 + un). We show that the only positive perfect powers in this sequence are u1 = 1 and u4 = 16. We also discuss the problem of determining perfect powers in Lucas sequences in general.
متن کاملDifferences between Perfect Powers
We apply the hypergeometric method of Thue and Siegel to prove, if a and b are positive integers, that the inequality 0 < |a − b | < 1 4 max{a, b} has at most a single solution in positive integers x and y. This essentially sharpens a classic result of LeVeque.
متن کاملPerfect Powers with Three Digits
We solve the equation xa + xb + 1= yq in positive integers x, y, a, b and q with a > b and q > 2 coprime to φ(x). This requires a combination of a variety of techniques from effective Diophantine approximation, including lower bounds for linear forms in complex and p-adic logarithms, the hypergeometric method of Thue and Siegel applied p-adically, local methods, and the algorithmic resolution o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Moscow journal of combinatorics and number theory
سال: 2021
ISSN: ['2640-7361', '2220-5438']
DOI: https://doi.org/10.2140/moscow.2021.10.261